A Definitional Approach to Functional Logic Programming
نویسنده
چکیده
We describe a deenitional approach to the combination of functional and logic programming based on the theory of Partial Induc-tive Deenitions. The described method produces programs directly exe-cutable in the deenitional programming language GCLA. We show both a basic calculus for functional logic program deenitions and discuss a reened version where the rules deenitional resolution, deenitional reeec-tion, and deenitional axiom are altered to be better suited for functional evaluation and equation solving.
منابع مشابه
A Note on Declarative Programming Paradigms and the Future of Definitional Programming
We discuss some approaches to declarative programming including functional programming, various logic programming languages and extensions, and definitional programming. In particular we discuss the programmers need and possibilities to influence the control part of programs. We also discuss some problems of the definitional programming language GCLA and try to find directions for future resear...
متن کاملOn GCLA, Gisela, and MedView Studies in Declarative Programming with Application to Clinical Medicine
Using declarative programming a programmer should be able to concentrate on what a program should do without worrying to much about how it is done. To be able to advance declarative programming methodologies, real-world examples are needed that push the limits of the proposed programming techniques. In this thesis we focus on some aspects of declarative programming, mostly from an applied angle...
متن کاملA Higher-Order Demand-Driven Narrowing Calculus with Definitional Trees
We generalize the Constructor-based ReWriting Logic CRWL to the setting of the simply typed λ-calculus, where theories are presented by conditional overlapping fully extended pattern rewrite systems. We claim that this logic is useful for higher-order functional-logic programming, and propose a Higher-Order Lazy Narrowing calculus HOLNDT for answering joinability and reducibility queries, in wh...
متن کاملAnalysing Definitional Trees: Looking for Determinism1
This paper describes how high level implementations of (needed) narrowing into Prolog can be improved by analysing definitional trees. First, we introduce a refined representation of definitional trees that handles properly the knowledge about the inductive positions of a pattern. The aim is to take advantage of the new representation of definitional trees to improve the aforementioned kind of ...
متن کاملRefined Definitional Trees and Prolog Implementations of Narrowing
This paper describes how high level implementations of (needed) narrowing into Prolog can be improved by introducing a refined representation of definitional trees that handles properly the knowledge about the inductive positions of a pattern. We define some generic algorithms that allow us to transform a functional logic program into a set of Prolog clauses which incorporates some refinements ...
متن کامل